Computer and Modernization ›› 2012, Vol. 203 ›› Issue (7): 55-57.doi: 10.3969/j.issn.1006-2475.2012.07.015

• 算法设计与分析 • Previous Articles     Next Articles

Application of Longest Common Subsequence Algorithm on Scoring of Filling in Blanks

ZHOU Hua-jun, DING Ai-fen, MA Rui-ying   

  1. Department of Information Science and Technology, Tourism and Culture College of Yunnan University, Lijiang 674100, China
  • Received:2012-05-08 Revised:1900-01-01 Online:2012-08-10 Published:2012-08-10

Abstract: This article discusses the longest common subsequence algorithm used on scoring of filling in blanks, and designs a common recognition logic of filling in the blanks based on net examination system. Its operation is feasible in independent academy net examination system.

Key words: longest common subsequence algorithm, filling in blanks, scoring, net examination system

CLC Number: